26 research outputs found
Some Properties of the Computable Cross Norm Criterion for Separability
The computable cross norm (CCN) criterion is a new powerful analytical and
computable separability criterion for bipartite quantum states, that is also
known to systematically detect bound entanglement. In certain aspects this
criterion complements the well-known Peres positive partial transpose (PPT)
criterion. In the present paper we study important analytical properties of the
CCN criterion. We show that in contrast to the PPT criterion it is not
sufficient in dimension 2 x 2. In higher dimensions we prove theorems
connecting the fidelity of a quantum state with the CCN criterion. We also
analyze the behaviour of the CCN criterion under local operations and identify
the operations that leave it invariant. It turns out that the CCN criterion is
in general not invariant under local operations.Comment: 7 pages; accepted by Physical Review A; error in Appendix B correcte
A Survey of Finite Algebraic Geometrical Structures Underlying Mutually Unbiased Quantum Measurements
The basic methods of constructing the sets of mutually unbiased bases in the
Hilbert space of an arbitrary finite dimension are discussed and an emerging
link between them is outlined. It is shown that these methods employ a wide
range of important mathematical concepts like, e.g., Fourier transforms, Galois
fields and rings, finite and related projective geometries, and entanglement,
to mention a few. Some applications of the theory to quantum information tasks
are also mentioned.Comment: 20 pages, 1 figure to appear in Foundations of Physics, Nov. 2006 two
more references adde
Escape time for a random walk from an orthant
Let {([xi]k, [eta]k), k>[greater-or-equal, slanted]} be a sequence of independent random vectors with values in {-1, 0, ...} x{-1, 0, ...}. Assume the component variables have zero means, bounded second moments, and that [alpha] = E[[xi]k[eta]k] is the same for all k. Let Zn denote (i0,j0)+[Sigma]n1 ([xi]k, where i0, j0 are positive integers, and let [tau] denote the first time Zn hits a coordinate axis. We show E([tau]) is finite if and only if [alpha]random walk martingales stopping times